Error-Correcting Codes from higher-dimensional varieties

In this paper we use intersection theory to develop methods for obtaining lower bounds on the parameters of algebraic geometric error-correcting codes constructed from varieties of arbitrary dimension. The methods are sufficiently general to encompass many of the codes previously constructed from higherdimensional varieties, as well as those coming from curves. And still, the bounds obtained are usually as good as the ones previously known (at least of the same order of magnitude with respect to the size of the ground field). Several examples coming from Deligne-Lusztig varieties, complete intersections of Hermitian hyper-surfaces, and from ruled surfaces (or more generally, projective bundles over a curve) are given.